Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data
نویسندگان
چکیده
منابع مشابه
Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data
Learnability of Pregroup Grammars p. 65 A Markovian Approach to the Induction of Regular String Distributions p. 77 Learning Node Selecting Tree Transducer from Completely Annotated Examples p. 91 Identifying Clusters from Positive Data p. 103 Introducing Domain and Typing Bias in Automata Inference p. 115 Analogical Equations in Sequences: Definition and Resolution p. 127 Representing Language...
متن کاملPolynomial Time Identification of Strict Prefix Deterministic Finite State Transducers
Introduction Gold (1967) defined the notion of identification in the limit. showed that even the class of regular languages is not identifiable in the limit from positive data. defined the notion of polynomial time identification in the limit [3]. has proposed another definition for polynomial time identifiability in the limit from positive data by making a slight modification of Pitt...
متن کاملLearning Visibly One-Counter Automata in Polynomial Time
Visibly one-counter automata are a restricted kind of one-counter automata: The input symbols are typed such that the type determines the instruction that is executed on the counter when the input symbol is read. We present an Angluin-like algorithm for actively learning visibly one-counter automata that runs in polynomial time in characteristic parameters of the target language and in the size...
متن کاملWeigthed omega-Restricted One Counter Automata
Let S be a complete star-omega semiring and Σ be an alphabet. For a weighted ω-restricted one counter automaton C with stateset {1, . . . ,n}, n ≥ 1, we show that there exists a mixed algebraic system over a complete semiringsemimodule pair ((S ≪ Σ∗ ≫)n×n, (S ≪ Σω ≫)n) such that the behavior ‖C‖ of C is a component of a solution of this system. In case the basic semiring is B or N∞ we show that...
متن کاملEecient Learning of Real Time One-counter Automata Eecient Learning of Real Time One Counter Automata
We present an eecient learning algorithm for languages accepted by deterministic real time one counter automata (ROCA). The learning algorithm works by rst learning an initial segment, B n , of the innnite state machine that accepts the unknown language and then decomposing it into a complete control structure and a partial counter. A new eecient ROCA decomposition algorithm, which will be pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2008
ISSN: 0916-8532,1745-1361
DOI: 10.1093/ietisy/e91-d.6.1704